Order-sorted logic programming with predicate hierarchy
نویسندگان
چکیده
منابع مشابه
Order-sorted logic programming with predicate hierarchy
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to useful expressions and inference methods for structural knowledge that ordinary first-order logic lacks. Nitta et al. pointed out that for legal reasoning a sort-hierarchy (or a sorted term) is not sufficient to describ...
متن کاملLogic Programming over Polymorphically Order-Sorted Types
This thesis presents the foundations for relational logic programming over polymorphically order-sorted data types. This type discipline combines the notion of parametric polymorphism, which has been developed for higher-order functional programming, with the notion of order-sorted typing, which has been developed for equational rst-order speci cation and programming. Polymorphically order-sort...
متن کاملCombining Order-Sorted Logic Programming with Formal Ontology
In formal ontology, entity types and relationships are philosophically defined, and the properties of objects are classified on the basis of sortality, rigidity, and identity (called property classification). Sorts and unary predicates are semantically identical in order-sorted logic, but they are respectively sortal and non-sortal (i.e., they are distinguished) in a formal ontology. This ontol...
متن کاملEvent, Property, and Hierarchy in Order-Sorted Logic
Knowledge representation in logics, even in the order-sorted logic that includes a sort hierarchy, tends to lose the conciseness and the nuances of natural language. If we could construct a logic that includes both predicates and terms as classes in the hierarchies, it would be very useful for connecting general knowledge to specic knowledge. Although there are actually logics that are equipped...
متن کاملProgramming with Dynamic Predicate Logic
We propose to bring together two research traditions, computation with first order logic from computer science, and dynamic interpretation of first order logic from natural language semantics. We define a new executable process interpretation for first order logic, and show that it is a faithful approximation of the dynamic interpretation procedure for first order formulas. We then demonstrate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2004
ISSN: 0004-3702
DOI: 10.1016/j.artint.2004.05.001